Polynomially Bounded Matrix Interpretations
نویسنده
چکیده
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are polynomially bounded. It includes the method of upper triangular interpretations as a special case, and we prove that the inclusion is strict. The criterion can be expressed as a finite domain constraint system. It translates to a Boolean constraint system with a size that is polynomial in the dimension of the interpretation. We report on performance of an implementation.
منابع مشابه
Polynomially bounded solutions of the Loewner differential equation in several complex variables
We determine the form of polynomially bounded solutions to the Loewner differential equation that is satisfied by univalent subordination chains of the form $f(z,t)=e^{int_0^t A(tau){rm d}tau}z+cdots$, where $A:[0,infty]rightarrow L(mathbb{C}^n,mathbb{C}^n)$ is a locally Lebesgue integrable mapping and satisfying the condition $$sup_{sgeq0}int_0^inftyleft|expleft{int_s^t [A(tau)...
متن کاملPolynomially Unbounded Product of Two Polynomially Bounded Operators
where S is a unilateral forward shift of infinite multiplicity, S∗ is its adjoint, and Yα is a matrix (αi+jCi+j ), with {αk}k∈N a sequence of complex numbers, and {Ck}k∈N a family of operators satisfying the “canonical anticommutation relations”. We exhibit a sequence {αk} such that T is polynomially bounded but T⊗T is not. This shows that the product of two commuting polynomially bounded opera...
متن کاملOn Polynomially Bounded Weighted Shifts, Ii
Let T be an operator-weighted shift whose weights are 2-by-2 matrices. We say that, given > 0, T is in the -canonical form if each weight is an upper triangular matrix (aij), with 0 ≤ a11, a22 ≤ 1 and a12 6= 0 implies a11, a22 < . We generalize this concept to operator-weighted shifts whose weights are n-by-n matrices and we show that every polynomially bounded weighted shift, whose weights are...
متن کاملQuasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static analysis. Basically, a sup-interpretation provides an upper bound on the size of function outputs. In this former work, a criterion, which can be applied to terminating as well as non-terminating programs, was developed...
متن کاملMatrices, Jordan Normal Forms, and Spectral Radius Theory
Matrix interpretations are useful as measure functions in termination proving. In order to use these interpretations also for complexity analysis, the growth rate of matrix powers has to examined. Here, we formalized an important result of spectral radius theory, namely that the growth rate is polynomially bounded if and only if the spectral radius of a matrix is at most one. To formally prove ...
متن کامل